Parity Quantum Optimization: Benchmarks

We present benchmarks of the parity transformation for Quantum Approximate Optimization Algorithm (QAOA). analyse gate resources required to implement a single QAOA cycle real-world scenarios. In particular, we consider random spin models with higher order terms, as well problems predicting financial crashes and finding ground states electronic structure Hamiltonians. For studied our findings imply significant advantage mapping compared standard model. combination full parallelizability gates this has potential boost race demonstrating quantum advantage.